Dynamic Planning and Scheduling for One-of-a-kind Assembly Production

A one-of-a-kind assembly production system is considered. In this system, every product has its own tree structure process route. The new order for the customized product arrives randomly and follows some known probability distribution. The objective is to assign an early due date to every new ordered product and guarantee that no already-arrived product will be delayed. In order to achieve this goal, we analyze the reasons that lead to tardiness in the considered production system and provide two types of effective dispatching rules that are combined by the three indices that represent the urgency of an operation in two different ways. Then we integrate the proposed rule into the binary searching algorithm for assigning due date. Numerical experiments indicate that the proposed integrated dynamic planning and scheduling algorithm assign comparatively early due dates to newly arrived orders and meanwhile guarantee the delivery reliability of all products.